Fuzzy Constraint Problems with General Aggregation Operations under Possibilistic Logic Form
نویسندگان
چکیده
In Fuzzy constraints satisfaction problem (FCSP), fuzzy constraints are aggregated by min operation into a fuzzy set membership function to be maximized. This representation framework, originally expressed in terms of membership functions, can be equivalently translated into a set of prioritized crisp constraints. We take advantage of this representation for modeling aggregations different from min, expressing either reinforcement or compensation. The approach offers a logical understanding of fuzzy constraints, which enable us to explicit the relaxation space, attached to a FCSP. This relaxation space may be usefully exploited for finding a maximally consistent relaxation of the original FCSP (this relaxation gives birth to a crisp feasible problem, which constraints as restrictive as possible).
منابع مشابه
A multi-product vehicle routing scheduling model with time window constraints for cross docking system under uncertainty: A fuzzy possibilistic-stochastic programming
Mathematical modeling of supply chain operations has proven to be one of the most complex tasks in the field of operations management and operations research. Despite the abundance of several modeling proposals in the literature; for vast majority of them, no effective universal application is conceived. This issue renders the proposed mathematical models inapplicable due largely to the fact th...
متن کاملPossibilistic linear regression analysis for fuzzy data
Fuzzy data given by expert knowledge can be regarded as a possibility distribution by which possibilistic linear systems are defined. Recently, it has become important to deal with fuzzy data in connection with expert knowledge. Three formulations of possibilistic linear regression analysis are proposed here to deal with fuzzy data. Since our formulations can be reduced to linear programming pr...
متن کاملA Possibilistic Approach to Bottleneck Combinatorial Optimization Problems with Ill-Known Weights
In this paper a general bottleneck combinatorial optimization problem with uncertain element weights modeled by fuzzy intervals is considered. A rigorous possibilistic formalization of the problem and solution concepts in this setting that lead to finding robust solutions under fuzzy weights are given. Some algorithms for finding a solution according to the introduced concepts and evaluating op...
متن کاملFuzzy Knowledge Representation Based on Possibilistic and Necessary Bayesian Networks
Within the framework proposed in this paper, we address the issue of extending the certain networks to a fuzzy certain networks in order to cope with a vagueness and limitations of existing models for decision under imprecise and uncertain knowledge. This paper proposes a framework that combines two disciplines to exploit their own advantages in uncertain and imprecise knowledge representation ...
متن کاملThe Use of Interval-Valued Probability Measures in Fuzzy Linear Programming: a constraint set approach
This paper uses a constraint set approach to linear programming problems with equality constraints whose coefficients and/or right-hand side values could be uncertain. We consider three types of uncertainty: probabilistic, fuzzy/possibilistic, and interval. The constraint set generated by the linear constraints under uncertainty is illdefined and difficult to generate. Our approach computes an ...
متن کامل